Colored Posets and Colored Quasisymmetric Functions
نویسندگان
چکیده
منابع مشابه
Colored Posets and Colored Quasisymmetric Functions
The colored quasisymmetric functions, like the classic quasisymmetric functions, are known to form a Hopf algebra with a natural peak subalgebra. We show how these algebras arise as the image of the algebra of colored posets. To effect this approach we introduce colored analogs of P -partitions and enriched P -partitions. We also frame our results in terms of Aguiar, Bergeron, and Sottile’s the...
متن کاملar X iv : m at h / 06 10 98 4 v 1 [ m at h . C O ] 3 1 O ct 2 00 6 COLORED POSETS AND COLORED QUASISYMMETRIC FUNCTIONS
The colored quasisymmetric functions, like the classic quasisymmetric functions, are known to form a Hopf algebra with a natural peak subalgebra. We show how these algebras arise as the image of the algebra of colored posets. To effect this approach we introduce colored analogs of P -partitions and enriched P -partitions. We also frame our results in terms of Aguiar, Bergeron, and Sottile’s the...
متن کاملColored Trees and Noncommutative Symmetric Functions
Let CRF S denote the category of S-colored rooted forests, and HCRFS denote its Ringel-Hall algebra as introduced in [6]. We construct a homomorphism from a K+ 0 (CRF S)–graded version of the Hopf algebra of noncommutative symmetric functions to HCRFS . Dualizing, we obtain a homomorphism from the Connes-Kreimer Hopf algebra to a K+ 0 (CRF S)–graded version of the algebra of quasisymmetric func...
متن کاملColored Trees in Edge-Colored Graphs
The study of problems modeled by edge-colored graphs has given rise to important developments during the last few decades. For instance, the investigation of spanning trees for graphs provide important and interesting results both from a mathematical and an algorithmic point of view (see for instance [1]). From the point of view of applicability, problems arising in molecular biology are often ...
متن کاملMaximum colored trees in edge-colored graphs
Abstract We consider maximum properly edge-colored trees in edge-colored graphs Gc. We also consider the problem where, given a vertex r, determine whether the graph has a spanning tree rooted at r, such that all root-to-leaf paths are properly colored. We consider these problems from graphtheoretic as well as algorithmic viewpoints. We prove their optimization versions to be NP-hard in general...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Combinatorics
سال: 2010
ISSN: 0218-0006,0219-3094
DOI: 10.1007/s00026-010-0059-0